On a base of symmetric group
نویسندگان
چکیده
منابع مشابه
A characterization of the symmetric group of prime degree
Let $G$ be a finite group and $Gamma(G)$ the prime graph of $G$. Recently people have been using prime graphs to study simple groups. Naturally we pose a question: can we use prime graphs to study almost simple groups or non-simple groups? In this paper some results in this respect are obtained and as follows: $Gcong S_p$ if and only if $|G|=|S_p|$ and $Gamma(G)=Gamma(S_p)$, whe...
متن کاملa characterization of the symmetric group of prime degree
let $g$ be a finite group and $gamma(g)$ the prime graph of $g$. recently people have been using prime graphs to study simple groups. naturally we pose a question: can we use prime graphs to study almost simple groups or non-simple groups? in this paper some results in this respect are obtained and as follows: $gcong s_p$ if and only if $|g|=|s_p|$ and $gamma(g)=gamma(s_p)$, whe...
متن کاملOn base sizes for symmetric groups
A base of a permutation group G on a set Ω is a subset B of Ω such that the pointwise stabilizer of B in G is trivial. The base size of G, denoted by b(G), is the minimal cardinality of a base. Let G = Sn or An acting primitively on a set with point stabilizer H. In this note we prove that if H acts primitively on {1, . . . , n}, and does not contain An, then b(G) = 2 for all n ≥ 13. Combined w...
متن کاملNotes on the symmetric group
Recall that, given a set X, the set SX of all bijections from X to itself (or, more briefly, permutations of X) is group under function composition. In particular, for each n ∈ N, the symmetric group Sn is the group of permutations of the set {1, . . . , n}, with the group operation equal to function composition. Thus Sn is a group with n! elements, and it is not abelian if n ≥ 3. If X is a fin...
متن کاملautomorphism group of a possible 2-(115,19,3) symmetric design
let be a set and let be the set of subsets of . the pair in which is a collection of elements of (blocks) is called a design if every element of appears in , times. is called a symmetric design if . in a symmetric design, each element of appears times in blocks of . a mapping between two designs and is an isomorphism if is a one-to-one correspondence and . every isomorphism of a design, , to it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky a fysiky
سال: 1939
ISSN: 1802-114X
DOI: 10.21136/cpmf.1939.121729